Reliable event transfer in wireless sensor networks deployed for emergency response

Sensor Networks have applications in diverse fields. They can be deployed for habitat modeling, temperature monitoring and industrial sensing. They also find application in battlefield awareness to sense chemicals and other gases used in chemical and biological warfare. An application that has become increasingly attractive in the post 9/11 era is the use of wireless sensor networks for emergency (first) response in mass casualty incidents. Reliability of data and event transfer is of critical importance to emergency response applications. In this work we propose a reliable event transfer mechanism making use of an overlay network of relay nodes. The overlay network removes the burden of data relaying from the sensor nodes and results in increasing the lifetime of the network. Simulation results prove the benefits of such an architecture. Reliability is increased 10-30% with reduction in event traffic of 60-80%.

Lease based addressing for event-driven wireless sensor networks

Sensor Networks have applications in diverse fields. They can be deployed for habitat modeling, temperature monitoring and industrial sensing. They also find applications in battlefield awareness and emergency (first) response situations. While unique addressing is not a requirement of many data collecting applications of wireless sensor networks it is vital for the success of applications such as emergency response. Data that cannot be associated with a specific node becomes useless in such situations. In this work we propose an addressing mechanism for event-driven wireless sensor networks. The proposed scheme eliminates the need for network wide Duplicate Address Detection (DAD) and enables reuse of addresses.

Address reuse in wireless sensor networks

Sensor Networks have applications in diverse fields. While unique addressing is not a requirement of many data collecting applications of wireless sensor networks, it is vital for the success of applications such as emergency response. Data that cannot be associated with a specific node becomes useless in such situations. In this work we propose a dynamic addressing mechanism for wireless sensor networks. The scheme enables successful reuse of addresses in event-driven wireless sensor networks. It also eliminates the need for network-wide Duplicate Address Detection (DAD) to ensure uniqueness of network level addresses.

Energy efficient on-demand addressing for wireless sensor networks

Conserving of battery power is a critical requirement in WSNs. Past studies have shown that the transceiving process consumes more energy than the internal processing. This work focuses on eliminating overhead messages used for address allocation by employing multiple base-stations. In this context we explore address allocation without Duplicate Address Detection (DAD). We present an alternative approach to Duplicate address detection using the sink as an address pool to maintain and systematize available addresses. Experimental results show that this approach eliminates overhead messages generated by DAD; resulting in energy savings when used in conjunction with an on-demand address allocation mechanism.

Using mobile agents to detect node compromise in path-based DoS attacks on wireless sensor networks

Wireless sensor networks represent a new generation of real-time  embedded systems with significantly different communication constraints from the traditional networked systems. With their development, a new attack called a path-based DoS (PDoS) attack has appeared. In a PDoS attack, an adversary, either inside or outside the network, overwhelms sensor nodes by flooding a multi-hop endto- end communication path with either replayed packets or injected spurious packets. In this article, we propose a solution using mobile agents which can detect PDoS attacks easily.

Using mobile agents to detect and recover from node compromise in path-based DoS attacks in wireless sensor networks

Wireless sensor networks represent a new generation of real-time embedded systems with significantly different communication constraints from the traditional networked systems. With their development, a new attack called a path-based DoS (PDoS) attack has appeared. In a PDoS attack, an adversary, either inside or outside the network, overwhelms sensor nodes by flooding a multi-hop end-to end communication path with either replayed packets or injected spurious packets. Detection and recovery from PDoS attacks have not been given much attention in the literature. In this article, we propose a solution using mobile agents which can detect PDoS attacks easily and efficiently and recover the compromised nodes.

Geographic routing with cooperative relaying and leapfrogging in wireless sensor networks

A novel geographic routing protocol for multi-hop wireless sensor networks is presented. It exploits the broadcast nature of the wireless channel to enable on-demand cooperative relaying and leapfrogging for circumventing weak radio links. In order to achieve energy efficiency, a metric is introduced for next-hop selection that takes into account information on the residual battery energy, the geographical position of the sensor nodes, and the channel quality of the involved radio links when available. Performance results show that the completely decentralized protocol offers significant benefits by reducing the number of (re)transmissions required to reach the destination. This translates into network-wide energy savings that extend the network lifetime.

The crossroads approach to information discovery in wireless sensor networks

Wireless sensor networks (WSN) are attractive for information gathering in large-scale data rich environments. In order to fully exploit the data gathering and dissemination capabilities of these networks, energy-efficient and scalable solutions for data storage and information discovery are essential. In this paper, we formulate the information discovery problem as a load-balancing problem, with the combined aim being to maximize network lifetime and minimize query processing delay resulting in QoS improvements. We propose a novel information storage and distribution mechanism that takes into account the residual energy levels in individual sensors. Further, we propose a hybrid push-pull strategy that enables fast response to information discovery queries.

Simulations results prove the proposed method(s) of information discovery offer significant QoS benefits for global as well as individual queries in comparison to previous approaches.

Dynamic route construction for mobile collectors in wireless sensor networks

Wireless sensor networks with mobile data collectors have been recently proposed for extending the sensor network lifetime. Powerful mobile collectors are deployed to patrol the network and approach the static sensors for collecting their data buffers using single hop communication. The route followed by the mobile collector is very crucial for the data collection operation performed in the network and highly impacts the data collection time. This paper presents a practically efficient algorithm for constructing the mobile collector route. The route is constructed dynamically during the network operational time regardless of the sensors data generation rates. The algorithm acts on minimizing the sleeping time and the number of sensors waiting for the arrival of the mobile collector. Simulation results demonstrate that the presented algorithm can effectively reduce the overall data collection time.

A practical framework for data collection in wireless sensor networks

Optimizing energy consumption for extending the lifetime in wireless sensor networks is of dominant importance. Groups of autonomous robots and unmanned aerial vehicles (UAVs) acting as mobile data collectors are utilized to minimize the energy expenditure of the sensor nodes by approaching the sensors and collecting their buffers via single hop communication, rather than using multihop routing to forward the buffers to the base station. This paper models the sensor network and the mobile collectors as a system-of-systems, and defines all levels and types of interactions. A practical framework that facilitates deploying heterogeneous mobiles without prior knowledge about the sensor network is presented. Realizing the framework is done through simulation experiments and tested against several performance metrics.

Decentralized mobility models for data collection in wireless sensor networks

Controlled mobility in wireless sensor networks provides many benefits towards enhancing the network performance and prolonging its lifetime. Mobile elements, acting as mechanical data carriers, traverse the network collecting data using single-hop communication, instead of the more energy demanding multi-hop routing to the sink. Scaling up from single to multiple mobiles is based more on the mobility models and the coordination methodology rather than increasing the number of mobile elements in the network. This work addresses the problem of designing and coordinating decentralized mobile elements for scheduling data collection in wireless sensor networks, while preserving some performance measures, such as latency and amount of data collected. We propose two mobility models governing the behaviour of the mobile element, where the incoming data collection requests are scheduled to service according to bidding strategies to determine the winner element. Simulations are run to measure the performance of the proposed mobility models subject to the network size and the number of mobile elements.

Performance of smart antennas with receive diversity in wireless sensor networks

In this paper we propose a Geometrically Based Single Bounce Elliptical Model (GBSBEM) for multipath components involving randomly placed scatterers in the scattering region with sensors deployed on a field. The system model assumes a cluster based wireless sensor network (WSN) which collects information from the sensors, filters and modulates the data and transmit it through a wireless channel to be collected at the receiver. We first develop a GBSBE model and based on this model we develop our channel model. Use of Smart antenna system at the receiver end, which exploits various receive diversity combining techniques like Maximal Ratio Combining (MRC), Equal Gain Combining (EGC), and Selection Combining (SC), adds novelty to this system. The performance of these techniques have been proved through matlab simulations and further ahead based on different number of antenna elements present at the receiver array, we calculate the performance of our system in terms of bit-error-rate (BER). Based on the transmission power we quantify for the energy efficiency of our communication model.

Using mobile agents to recover from node and database compromise in path-based DoS attacks in wireless sensor networks

Wireless sensor networks represent a new generation of real-time embedded systems with significantly different communication constraints from the traditional networked systems. With their development, a new attack called a path-based DoS (PDoS) attack has appeared. In a PDoS attack, an adversary, either inside or outside the network, overwhelms sensor nodes by flooding a multi-hop end-to-end communication path with either replayed packets or injected spurious packets. Detection and recovery from PDoS attacks have not been given much attention in the literature. In this article, we consider wireless sensor networks designed to collect and store data. In a path-based attack, both sensor nodes and the database containing collected data can be compromised. We propose a recovery method using mobile agents which can detect PDoS attacks easily and efficiently and recover the compromised nodes along with the database.

Cooperative relaying in wireless sensor networks

Cooperative relaying has been shown to be an effective method to significantly improve the error-rate performance in wireless networks. This technique combats fading by exploiting the spatial diversity made available through cooperating nodes that relay signals for each other. In the context of wireless sensor networks, cooperative relaying can be applied to reduce the energy consumption in sensor nodes and thus extend the network lifetime. Realizing this benefit, however, requires a careful incorporation of this technique into the routing process to exploit diversity gains. In this chapter, we introduce the basic concepts required to understand cooperative relaying and review current state of the art energy-efficient routing protocols that realize cooperative relaying.

Energy-efficient medium access control in wireless sensor networks

Medium access control for wireless sensor networks has been an active
research area in the past decade. This chapter discusses a set of important medium access control (MAC) attributes and possible design trade-offs in protocol design, with an emphasis on energy efficiency. Then we categorize existing MAC protocols into five groups, outline the representative protocols, and compare their advantages and disadvantages in the context of wireless sensor network. Finally, thoughts for practitioners are presented and open research issues are also discussed.